Schedulability Comparisons between Priority Queue and FIFO Queue for CAN Messages with Offsets

نویسندگان

  • Yang Chen
  • Ryo Kurachi
  • Gang Zeng
  • Hiroaki Takada
چکیده

The Controller Area Network (CAN) is a widely used in-vehicle network and its schedulability is particularly important. In a CAN system, implementing the priority queues is better than FIFO queues with respect to the schedulability, which is widely recognized by users. In this paper, we investigate whether and how much implementing the priority queues is better than FIFO queues when the offset assignment for CAN messages is conducted. Our results show that usually the priority queues are better, whereas the FIFO queues are better in some specific situations. Furthermore, we propose a new scheduling method for obtaining the advantages of both queues, which improves the schedulability effectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real Time Scheduling and Analysis for Can Messages with Offsets

The Controller Area Network (CAN) was designed as a simple, efficient and robust broadcast communications bus for in-vehicle networks; and it has been widely used by automotive manufacturers in recent decades. In the development of CAN system, schedulability analysis theory plays an important role in evaluating whether the system is schedulable or not. This is accomplished by calculating the WC...

متن کامل

Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis

Although many multiprocessor resource sharing protocols have been proposed, their impacts on the schedulability of real-time tasks are largely ignored in most of the existing literature. Recently, work has been done to integrate queue locks (FIFO-queue-based non-preemptive spin locks) with multiprocessor schedulability analysis but the techniques used introduce a substantial amount of pessimism...

متن کامل

Improved Schedulability Analysis for Multiprocessor Systems with Resource Sharing

Abstract—This report presents our recent efforts to close the gap between the state-of-the-art homogeneous (or identical) multiprocessor and uniprocessor schedulability analyses in the context of resource sharing. Although many multiprocessor resource sharing protocols have been proposed, their impact on the schedulability of real-time tasks is largely ignored in most existing literature. Recen...

متن کامل

Scheduling algorithm for hard real-time communication in demand priority network

This paper addresses the problem of scheduling periodic messages in demand priority network standardized by IEEE 802.12 Committee. As regards the real-time property of the demand priority network, unnecessary blocking time due to its round-robin-based MAC protocol may cause periodic messages to miss their hard deadlines and result in low schedulability of periodic messages. We propose a new mes...

متن کامل

A Finite Capacity Priority Queue with Discouragement

In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013